Satisfiability Algorithm for Syntactic Read-k-times Branching Programs
نویسندگان
چکیده
منابع مشابه
A Lower Bound for Randomized Read-k-Times Branching Programs
In this paper, we are concerned with randomized OBDDs and randomized read-k-times branching programs. We present an example of a Boolean function which has polynomial size randomized OBDDs with small, one-sided error, but only non-deterministic read-once branching programs of exponential size. Furthermore, we discuss a lower bound technique for randomized OBDDs with two-sided error and prove an...
متن کاملA Note on Read-k Times Branching Programs
A syntactic read-k times branching program has the restriction that no variable occurs more than k times on any path (whether or not consistent). We exhibit an explicit Boolean function f; which cannot be computed by nondeterministic syntactic read-k times branching programs of size less than exp p n k 2k ; although its complement :f has a nondeterministic syntactic read-once branching program ...
متن کاملLower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract)
Randomized branching programs are a probabilistic model of computation defined in analogy to the well-known probabilistic Turing machines. In this paper, we contribute to the complexity theory of randomized read-k-times branching programs. We first consider the case k = 1 and present a function which has nondeterministic read-once branching programs of polynomial size, but for which every rando...
متن کاملOn the Hierarchies for Deterministic, Nondeterministic and Probabilistic Ordered Read-k-times Branching Programs
The paper examines hierarchies for nondeterministic and deterministic ordered read-k-times Branching programs. The currently known hierarchies for deterministic k-OBDD models of Branching programs for k = o(n1/2/ log n) are proved by B. Bollig, M. Sauerhoff, D. Sieling, and I. Wegener in 1998. Their lower bound technique was based on communication complexity approach. For nondeterministic k-OBD...
متن کاملLower Bound and Hierarchies for Quantum Ordered Read-k-times Branching Programs
We consider quantum version of known computational model Ordered Read-k-times Branching Programs or Ordered Binary Decision Diagrams with repeated test (k-QOBDD). We get lower bound for quantum k-OBDD for k = o( √ n). This lower bound gives connection between characteristics of model and number of subfunctions for function. Additionally, we prove the hierarchies for sublinear width bounded erro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2020
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-020-09996-3